Blocking sequentially processed magnetic files

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-blocking Writes to Files

Writing data to a page not present in the file-system page cache causes the operating system to synchronously fetch the page into memory first. Synchronous page fetch defines both policy (when) and mechanism (how), and always blocks the writing process. Non-blocking writes eliminate such blocking by buffering the written data elsewhere in memory and unblocking the writing process immediately. S...

متن کامل

Data Organization in Magnetic Bubble Lattice Files

In this paper, we discuss several aspects of data organization in the framework of a recently developed magnetic bubble memory technology known as a bubble lattice file. A dynamic ordering scheme, different from those implemented in conventional T-I bar bubble memories, is proposed. This ordering is particularly suited for bubble lattices. Some performance figures are included for comparison. I...

متن کامل

Blocking temperature in magnetic nanoclusters.

A recent study of non-extensive phase transitions in nuclei and nuclear clusters needs a probability model compatible with the appropriate Hamiltonian. For magnetic molecules a representation of the evolution by a Markov process achieves the required probability model that is used to study the probability density function (PDF) of the order parameter, i.e., the magnetization. The existence of o...

متن کامل

SEQUENTIALLY COMPACT S-ACTS

‎‎The investigation of equational compactness was initiated by‎ ‎Banaschewski and Nelson‎. ‎They proved that pure injectivity is‎ ‎equivalent to equational compactness‎. ‎Here we define the so‎ ‎called sequentially compact acts over semigroups and study‎ ‎some of their categorical and homological properties‎. ‎Some‎ ‎Baer conditions for injectivity of S-acts are also presented‎.

متن کامل

Loading Large Sparse Matrices Stored in Files in the Adaptive-Blocking Hierarchical Storage Format

The parallel algorithm for loading large sparse matrices from files into distributed memories of high performance computing (HPC) systems is presented. This algorithm was designed specially for matrices stored in files in the space-efficient adaptive-blocking hierarchical storage format (ABHSF). The algorithm can be used even if matrix storing and loading procedures use a different number of pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1971

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/14.2.109